DISCRETE STEEPEST DESCENTIN REAL TIME Selim
نویسنده
چکیده
A general framework is proposed for the study of real-time algorithms. The framework uniies previous algorithmic deenitions of real-time computation. In it, state space traversal is used as a model for computational problems in a real-time environment. The proposed framework also employs a paradigm, known as discrete steepest descent, for algorithms designed to solve these problems. Sequential and parallel algorithms for traversing a state space by discrete steepest descent are then analyzed and compared. The analysis measures the value (or worth) of a computed solution. The quantity used in the evaluation may be the time required by an algorithm to reach the solution, the quality of the solution obtained, or any similar measure. The value of a real-time solution obtained in parallel is shown to be consistently superior to that of a solution computed sequentially by an amount superlinear in the size of the problem.
منابع مشابه
An Algorithmic Model for Real-Time Computation
A general framework is proposed for the study of real-time algorithms. The framework uniies previous algorithmic deenitions of real-time computation. In it, state space traversal is used as a model for computational problems in a real-time environment. The proposed framework also employs a paradigm, known as discrete steepest descent, for algorithms designed to solve these problems. Sequential ...
متن کاملUniform Asymptotics for Discrete Orthogonal Polynomials with Respect to Varying Exponential Weights on a Regular Infinite Lattice
Abstract. We consider the large-N asymptotics of a system of discrete orthogonal polynomials on an infinite regular lattice of mesh 1 N , with weight e , where V (x) is a real analytic function with sufficient growth at infinity. The proof is based on formulation of an interpolation problem for discrete orthogonal polynomials, which can be converted to a Riemann-Hilbert problem, and steepest de...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Discrete L-/M-Convex Function Minimization Based on Continuous Relaxation
We consider the problem of minimizing a nonlinear discrete function with L-/M-convexity proposed in the theory of discrete convex analysis. For this problem, steepest descent algorithms and steepest descent scaling algorithms are known. In this paper, we use continuous relaxation approach which minimizes the continuous variable version first in order to find a good initial solution of a steepes...
متن کاملRecent Developments in Discrete Event Systems
This article is a brief exposure of the process approach to a newly emerging area called "discrete event systems" in control theory and summarizes some of the recent developments in this area. Discrete event systems is an area of research that is developing within the interstices of computer, control and communication sciences. The basic direction of research addresses issues in the analysis an...
متن کاملOn the Design of Nonlinear Discrete-Time Adaptive Controller for damaged Airplane
airplane in presence of asymmetric left-wing damaged. Variations of the aerodynamic parameters, mass and moments of inertia, and the center of gravity due to damage are all considered in the nonlinear mathematical modeling. The proposed discrete-time nonlinear MRAC algorithm applies the recursive least square (RLS) algorithm as a parameter estimator as well as the error between the real ...
متن کامل